On Membership Comparable Sets
نویسندگان
چکیده
منابع مشابه
On Membership Comparable Sets
A set A is k(n) membership comparable if there is a polynomial time computable function that, given k(n) instances of A of length at most n, excludes one of the 2 k(n) possibilities for the memberships of the given strings in A. We show that if SAT is O(log n) membership comparable, then UniqueSAT 2 P. This extends the and answers in the aarmative an open question suggested by Buhrman, Fortnow,...
متن کاملPolynomial-Time Membership Comparable Sets
This paper studies a notion called polynomial-time membership comparable sets. For a function g, a set A is polynomial-time g-membership comparable if there is a polynomialtime computable function f such that for any x1; ; xm with m g(maxfjx1j; ; jxmjg), outputs b 2 f0; 1gm such that (A(x1); ; A(xm)) 6= b. The following is a list of major results proven in the paper. 1. Polynomial-time membersh...
متن کاملMembership Comparable and p-Selective Sets
We show that there exists a 2-membership comparable set that is not btt-reducible to any pselective set. This is a rare example of an unconditional separation in computational complexity. More generally there are 2-membership comparable sets that are not n-tt-reducible to any pselective sets for any constant c. The proof of this result heavily relies on the fact that the p-selector must examine...
متن کاملA Note on the Power of Extra Queries to Membership Comparable Sets
A language is called k-membership comparable if there exists a polynomial-time algorithm that excludes for any k words one of the 2 possibilities for their characteristic string. It is known that all membership comparable languages can be reduced to some P-selective language with polynomially many adaptive queries. We show however that for all k there exists a (k + 1)-membership comparable set ...
متن کاملTIME-VARYING FUZZY SETS BASED ON A GAUSSIAN MEMBERSHIP FUNCTIONS FOR DEVELOPING FUZZY CONTROLLER
The paper presents a novel type of fuzzy sets, called time-Varying Fuzzy Sets (VFS). These fuzzy sets are based on the Gaussian membership functions, they are depended on the error and they are characterized by the displacement of the kernels to both right and left side of the universe of discourse, the two extremes kernels of the universe are fixed for all time. In this work we focus only on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1999.1653